Reuse Distance Based Cache Leakage Control
نویسندگان
چکیده
As feature size shrinks, the dominant component of power consumption will be leakage. As caches represent a considerable fraction of area for many platforms, from embedded to highly paralleled systems, cache leakage control continues to become a critical issue. Drowsy cache technique is a state-preserving technique which reduces leakage by pulling down the voltages on selected lines. To exploit the temporal locality present in the data stream, existing drowsy cache policies update drowsy/active mode after an execution window of fixed clock cycles, which lack the flexibility to adapt to program behavior. We introduce a tri-mode FSM control policy, which exploits global Reuse Distance information and tries to keep a small set of lines in active for future references, after each N distinct line references. This Reuse Distance based policy well adapts to the temporal locality, steadily delivers better energy savings with similar performance overhead, is simple to implement, and places an upper bound on leakage power.
منابع مشابه
Reuse-Aware Management for Last-Level Caches
Variability in generational behavior of cache blocks is a key challenge for cache management policies that aim to identify dead blocks as early and as accurately as possible to maximize cache efficiency. Existing management policies are limited by the metrics they use to identify dead blocks, leading to low coverage and/or low accuracy in the face of variability. In response, we introduce a new...
متن کاملFRD: A Filtering based Buffer Cache Algorithm that Considers both Frequency and Reuse Distance
Buffer cache algorithms play a major role in filling the large performance gap between main memory and I/O devices in a mass storage system. Many buffer cache algorithms have been developed such as the low inter-reference recency set (LIRS) and adaptive replacement cache (ARC). Careful analysis of real-world workloads leads us to observe that approximately 50 to 90% blocks are accessed three or...
متن کاملReuse-based Analytical Models for Caches
We develop a reuse distance/stack distance based analytical modeling framework for efficient, online prediction of cache performance for a range of cache configurations and replacement policies LRU, PLRU, RANDOM, NMRU. Such a predictive framework can be extremely useful in selecting the optimal parameters in a dynamic reconfiguration environment that performs power-shifting or resource realloca...
متن کاملImproving Adaptive Replacement Cache (ARC) by Reuse Distance
Buffer caches are used to enhance the performance of file or storage systems by reducing I/O requests to underlying storage media. In particular, multi-level buffer cache hierarchy is commonly deployed on network file systems or storage systems. In this environment, the I/O access pattern on second-level buffer caches of file servers or storage controllers differs from that on upperlevel caches...
متن کاملIs Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further highlighting the importance of data locality analysis. As a rigorous and hardware-independent locality metric, reuse distance has served for a variety of locality analysis, program transformations, and performance pred...
متن کامل